Structure, Theoretical Computer Science, Special Issue on CCA'97, to appear. [44] Mariko Yasugi and Osamu Takaki,

Random Iteration Algorithm for Graph-Directed Sets

A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtained by this algorithm reflect a probability measure which is invariant with respect to the system of contractions with probabilities.

Computability of Probability Distributions and Characteristic Functions

As a part of our works on effective properties of probability distributions, we deal with the corresponding characteristic functions. A sequence of probability distributions is computable if and only if the corresponding sequence of characteristic functions is computable. As for the onvergence problem, the effectivized Glivenko’s theorem holds. Effectivizations of Bochner’s theorem and de Moivr...

Computability of Probability Distributions and Distribution Functions

We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a probability distribution and that of the corresponding distribution function are discussed. It is carried out through attempts to effectivize some classical fundamental theorems concerning probability distributions. We th...

From Models to Languages

This special issue is devoted to various areas in Theoretical Computer Science. The issue took inspiration from the 13th Italian Conference on Theoretical Computer Science (ICTCS 2012), held at University of Insubria in Varese, Italy, on September 19-21 2012. The special issue contains seven papers, that have been originated from the work in progress presented at the conference, and that have b...

Cut elimination theorem for the second order arithmetic with the π1 1-comprehension axiom and the ω-rule